Global Properties of the Turing Degrees and the Turing Jump
نویسنده
چکیده
We present a summary of the lectures delivered to the Institute for Mathematical Sciences, Singapore, during the 2005 Summer School in Mathematical Logic. The lectures covered topics on the global structure of the Turing degrees D, the countability of its automorphism group, and the definability of the Turing jump within D.
منابع مشابه
Some improvements in fuzzy turing machines
In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...
متن کاملWorkshop in Computability Theory Paris - July 2010
A pair of sets of natural numbers A and B forms a K-pair if there exists a c.e. set W , such that A × B ⊆ W and A × B ⊆ W . Kpairs are introduced by Kalimullin and used by him to prove the first order definability of the enumeration jump operator in the global structure of the enumeration degrees. He shows that the property of being a K-pair is degree theoretic and first order definable in the ...
متن کاملBayesian perspective over time
Thomas Bayes, the founder of Bayesian vision, entered the University of Edinburgh in 1719 to study logic and theology. Returning in 1722, he worked with his father in a small church. He also was a mathematician and in 1740 he made a novel discovery which he never published, but his friend Richard Price found it in his notes after his death in 1761, reedited it and published it. But until L...
متن کاملA Bounded Jump for the Bounded Turing Degrees
We define the bounded jump of A by A = {x ∈ ω | ∃i ≤ x[φi(x) ↓ ∧ Φ φi(x) x (x)↓]} and let A denote the n-th bounded jump. We demonstrate several properties of the bounded jump, including that it is strictly increasing and order preserving on the bounded Turing (bT ) degrees (also known as the weak truth-table degrees). We show that the bounded jump is related to the Ershov hierarchy. Indeed, fo...
متن کاملThe enumeration degrees: Local and global structural interactions
We show that the structure of the enumeration degrees De has a finite automorphism base consisting of finitely many total elements below the first jump of its least element. As a consequence we obtain that the rigidity of the structure of the enumeration degrees is implied by the rigidity of the local structures of the Σ2 enumeration degrees, the ∆ 0 2 Turing degrees and the computably enumerab...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007